On arc-traceable tournaments
نویسندگان
چکیده
A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e. a hamiltonian path. Given a tournament T , it is well known that it contains a directed hamiltonian path. In this paper, we develop the structure necessary for a tournament T to contain an arc xy that is not on any hamiltonian path. Using this structure, we give sufficient conditions for a tournament to be arc-traceable. In addition, we give examples to show that these conditions are best possible. c
منابع مشابه
On a conjecture of Quintas and arc-traceability in upset tournaments
A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e., hamiltonian path. We prove a conjecture of Quintas [7]: if D is arc-traceable, then the condensation of D is a directed path. We show that the converse of this conjecture is false by providing an example of an upset tournament which is not arc-traceable. We then giv...
متن کاملA Linear Bound towards the Traceability Conjecture
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. An oriented graph is a digraph without 2-cycles. The 2-traceable oriented graphs are exactly the nontrivial tournaments, so k-traceable oriented graphs may be regarded as generalized tournaments. It is well-known that all tournaments are traceable. We denote by t(k) the smallest integer bigg...
متن کاملTraceability of k-traceable oriented graphs
A digraph of order at least k is k-traceable if each of its subdigraphs of order k is traceable. We note that 2-traceable oriented graphs are tournaments and for k ≥ 3, k-traceable oriented graphs can be regarded as generalized tournaments. We show that for 2 ≤ k ≤ 6 every k-traceable oriented graph is traceable, thus extending the well known fact that every tournament is traceable. This result...
متن کاملPath - connect iv i ty in local tournaments 1
A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancycl...
متن کاملPaths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 53 شماره
صفحات -
تاریخ انتشار 2006